Satisfiability Application-Dependent Testing of FPGA using Quantum Computing
نویسندگان
چکیده
ii Declaration I hereby certify that the work which is being presented in the thesis entitled, (Deemed University), Patiala, is an authentic record of my own work carried out under the supervision of Mr. Amardeep Singh. The matter presented in this thesis has not been submitted by me for the award of any other degree of this or any other University. This is to certify that the above statement made by the candidate is correct and true to best of my knowledge. Acknowledgement
منابع مشابه
Neuro-fuzzy control of bilateral teleoperation system using FPGA
This paper presents an adaptive neuro-fuzzy controller ANFIS (Adaptive Neuro-Fuzzy Inference System) for a bilateral teleoperation system based on FPGA (Field Programmable Gate Array). The proposed controller combines the learning capabilities of neural networks with the inference capabilities of fuzzy logic, to adapt with dynamic variations in master and slave robots and to guarantee good prac...
متن کاملA Brief Introduction to Application-Dependent FPGA Testing
This paper gives a brief introduction to the application-dependent FPGA testing. In comparison with the conventional application-independent FPGA testing whose objective is to test the resources of a FPGA chip as exhaustively as possible, application-dependent FPGA testing is only performed on the resources used by a specific application implemented on the FPGA. The multi-configuration strategy...
متن کاملمدل عملکردی تحلیلی FPGA برای پردازش با قابلیت پیکربندی مجدد
Optimizing FPGA architectures is one of the key challenges in digital design flow. Traditionally, FPGA designers make use of CAD tools for evaluating architectures in terms of the area, delay and power. Recently, analytical methods have been proposed to optimize the architectures faster and easier. A complete analytical power, area and delay model have received little attention to date. In addi...
متن کاملA Virtual Logic Algorithm for Solving Satisfiability Problems Using Reconfigurable Hardware
Satisfiability (SAT) is a computationally expensive algorithm central to computer science. In this paper, we present a virtual logic algorithm that allows an FPGA based reconfigurable computing platform to process SAT solver circuits much larger than its available capacity. Our algorithm is based on decomposition techniques that create independent subproblems that fit the size of the available ...
متن کاملHigh-speed processor for quantum-computing emulation and its applications
A high-speed and large-scale processor dedicated to quantum computing is proposed, which has the minimum operation function needed for execution of a quantum algorithm. In this processor, the probability amplitudes determined by the states of the quantum bits in the quantum computer are described using only one bit, and we named it a logic quantum processor. It is found that for this processor ...
متن کامل